Transfer Learning to Accelerate Interface Structure Searches
نویسندگان
چکیده
منابع مشابه
Reusing Old Policies to Accelerate Learning onNew
We consider the reuse of policies for previous MDPs in learning on a new MDP, under the assumption that the vector of parameters of each MDP is drawn from a xed probability distribution. We use the options framework, in which an option consists of a set of initiation states, a policy, and a termination condition. We use an option called a reuse option, for which the set of initiation states is ...
متن کاملDoes learning accelerate evolution?
This paper reviews the recent progress in the investigation into how learning can effect evolutionary dynamics after a century of sharply con¤icting views. The results are signi£cant both for theoretical biologists of various stripes and for computer scientists working on computational intelligence and other subdisciplines which often rely on the transfer of biological principles to digital sys...
متن کاملAccelerate Learning Processes by Avoiding Inappropriate Rules in Transfer Learning for Actor - Critic
hh tt tt Abstruct—This paper aims to accelerate processes of actor-critic method, which is one of major reinforcement learning algorithms, by a transfer learning. In general, reinforcement learning is used to solve optimization problems. Learning agents acquire a policy to accomplish the target task autonomously. To solve the problems, agents require long learning processes for trial and error....
متن کاملLearning to locate from demonstrated searches
We consider the problem of learning to locate targets from demonstrated searches. In this concept, a human demonstrates tours of environments that are assumed to minimize the human’s expected time to locate the target, given the person’s latent prior over potential target locations. The latent prior is then learned as a function of environmental features, enabling a robot to search novel enviro...
متن کاملInductive Transfer for Bayesian Network Structure Learning
We consider the problem of learning Bayes Net structures for related tasks. We present an algorithm for learning Bayes Net structures that takes advantage of the similarity between tasks by biasing learning toward similar structures for each task. Heuristic search is used to find a high scoring set of structures (one for each task), where the score for a set of structures is computed in a princ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Physical Society of Japan
سال: 2017
ISSN: 0031-9015,1347-4073
DOI: 10.7566/jpsj.86.123601